On (finite) distributive lattices with antitone involutions
نویسندگان
چکیده
Some well-known algebras of logic or other algebraic models of non-classical reasoning, such as MV-algebras or orthomodular lattices, can be regarded as lattices with antitone involutions, i.e., bounded lattices with the property that all principal filters (or ideals) are equipped with antitone involutions. This simple observation is behind the so-called “basic algebras” that were introduced in [1] in an attempt to generalize orthomodular lattices in a similar way in which MV-algebras generalize boolean algebras. Roughly speaking, a basic algebra is an algebra 〈A;⊕,¬, 0, 1〉 of type 〈2, 1, 0, 0〉 such that the rule x ≤ y iff ¬x⊕y = 1 defines a bounded lattice in which, for every a ∈ A, the map fa : x 7→ ¬x ⊕ a is an antitone involution on the interval [a, 1], and where ¬x = f0(x) and x⊕y = fy(¬x∨y) for all x, y ∈ A. MV-algebras then coincide with the associative (and commutative) basic algebras, and orthomodular lattices with those satisfying the quasi-identity x ≤ y ⇒ y ⊕ x = y. In general, we cannot say much about the underlying lattice of a basic algebra, but in several important particular cases, when the antitone involutions satisfy certain natural conditions, the lattice is distributive. Therefore, we focus on distributive basic algebras, with emphasis on the structure of finite ones. The main objective for the first part is to prove that the underlying lattice of a finite distributive basic algebra is a direct product of chains, though the algebra itself need not be an MV-algebra. This means that all finite distributive basic algebras can be obtained from finite MV-algebras by “perturbing” the standard pointwise “MV-involutions”. In the second part we consider algebras satisfying the identity x ≤ x ⊕ y, which is the most general version of the aforementioned natural conditions, because it actually says that f0(x) ≤ fa(x) for all a ≤ x. Among others, we prove that these basic algebras are distributive and in the finite case they are just MV-algebras. Finally, in the third part we deal with lattice effect algebras that play an important role in investigating the logical foundations of quantum mechanics and can also be identified with certain basic algebras. Besides proving that every lattice effect algebra satisfying x ≤ x⊕ y is an MV-algebra, we focus on the variety of distributive lattice effect algebras.
منابع مشابه
Ring-like Structures Derived from Λ-lattices with Antitone Involutions
Using the concept of the λ-lattice introduced recently by V. Snášel we define λ-lattices with antitone involutions. For them we establish a correspondence to ring-like structures similarly as it was done for ortholattices and pseudorings, for Boolean algebras and Boolean rings or for lattices with an antitone involution and the so-called Boolean quasirings.
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملDistributive Lattices with a given Skeleton
We present a construction of finite distributive lattices with a given skeleton. In the case of an H-irreducible skeleton K the construction provides all finite distributive lattices based on K, in particular the minimal one.
متن کاملPolynomial Permutations on Finite Lattices Related to Cryptography
Motivated by cryptography, permutations induced by polynomial functions on finite lattices L = (L,∨,∧,∗ ) with an antitone involution ∗ are investigated. These permutations together with the operation of composition form a subgroup of the symmetric group on L. We describe the structure of this subgroup for different classes of lattices L and indicate possible applications by outlining a protoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Soft Comput.
دوره 18 شماره
صفحات -
تاریخ انتشار 2013